Before 4.0.0.Beta1, cache store modifications were queued in such way that a modification processor thread would empty the modification queue and apply each modification individually. This implementation was not able to detect multiple changes for the same key within the queue which meant that if the queue contained 10 modifications for the same key, it would apply all 10 modifications individually.

Since 4.0.0.Beta1 (ISPN-116), modifications are coalesced or aggregated for the interval that the modification processor thread is currently applying. This means that while changes are being queued, if multiple modifications are made to the same key, only the key's last state will be applied, hence reducing the number of calls to the cache store.